Length of the Longest Common Subsequence between Overlapping Words
نویسندگان
چکیده
منابع مشابه
Longest Common Subsequence in k Length Substrings
In this paper we define a new problem, motivated by computational biology, LCSk aiming at finding the maximal number of k length substrings, matching in both input strings while preserving their order of appearance. The traditional LCS definition is a special case of our problem, where k = 1. We provide an algorithm, solving the general case in O(n) time, where n is the length of the input stri...
متن کاملFluctuation of the Length of the Longest Common Subsequence
Let X1, . . . , Xn and Y1, . . . , Yn be two independent sequences of i.i.d Bernoulli variables with parameter > 0. Let X designate the string X := X1X2 . . . Xn and let Y := Y1Y2 . . . Yn. Let Ln designate the length of the longest common subsequence (LCS) of X and Y . We prove that for a constant c > 0, VAR[Ln] > cn if > 0 is taken small enough. Hence for small , the order of magnitude of VAR...
متن کاملExpected Length of the Longest Common Subsequence for Large Alphabets
We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield that E [L] /n converges to a constant γk. We prove a conjecture of Sankoff and Mainville from the early 80’s claiming that γk √ k → 2 as k → ∞.
متن کاملThe Longest Common Subsequence Problem
Algorithms on sequences of symbols have been studied for a long time and now form a fundamental part of computer science. One of the very important problems in analysis of sequences is the longest common subsequence problem. For the general case of an arbitrary number of input sequences, the problem is NP-hard. We describe an approach to solve this problem. This approach is based on constructin...
متن کاملRepetition-free longest common subsequence
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a complexity result, and we describe a preliminary experimental study based on the proposed algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2020
ISSN: 0895-4801,1095-7146
DOI: 10.1137/18m1176786